A novel population-based local search for nurse rostering problem
نویسندگان
چکیده
Population-based approaches regularly are better than single based (local search) in exploring the search space. However, drawback of population-based is exploiting Several hybrid have proven their efficiency through different domains optimization problems by incorporating and integrating strength population local approaches. Meanwhile, methods a increasing parameter tuning. Recently, was proposed for university course-timetabling problem with fewer parameters existing approaches, approach proves its effectiveness. The employs two operators to intensify diversify first operator applied solution, while second all solutions. This paper aims investigate performance nurse rostering problem. INRC2010 database dataset composed 69 instances used test PB-LS. A comparison made between PB-LS other literature. Results show good performances compared where provided best results 55 cases over experiments.
منابع مشابه
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem
This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research were applied) tackled manually. The problem basically concerns the assignment of duties to a set of people with different qualifications, work regulations and preferences. Constraint programming and linear programming techniques ...
متن کاملA novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملA Constraint-directed Local Search Approach to Nurse Rostering Problems
In this paper, we investigate the hybridization of constraint programming and local search techniques within a large neighbourhood search scheme for solving highly constrained nurse rostering problems. As identified by the research, a crucial part of the large neighbourhood search is the selection of the fragment (neighbourhood, i.e. the set of variables), to be relaxed and re-optimized iterati...
متن کاملA variable neighborhood search based matheuristic for nurse rostering problems
A practical nurse rostering problem, which arises at a ward of an Italian private hospital, is considered. In this problem, it is required each month to generate the nursing staff shifts subject to various requirements. A matheuristic approach is introduced, based on a set of neighborhoods searched by a commercial integer programming solver within a defined global time limit. Generally speaking...
متن کاملLocal Search Neighbourhoods to Deal with a Novel Nurse Rostering Model
A novel nurse rostering model is developed to represent real world problem instances more accurately. The proposed model is generic in a way that different problem instances can be successfully represented. Novel local search neighbourhoods are developed to take advantage of the problem properties represented by the model. These neighbourhoods are utilised within a variable neighbourhood search...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Power Electronics and Drive Systems
سال: 2021
ISSN: ['2722-2578', '2722-256X']
DOI: https://doi.org/10.11591/ijece.v11i1.pp471-480